Characterization and algorithm for bivariate multi-unit assignment valuations
نویسندگان
چکیده
Abstract A multi-unit assignment valuation is a function represented by weighted bipartite graph. In this paper, we provide characterization of such in terms maximizer sets perturbed functions. We then present an algorithm that checks whether given bivariate valuation, and if the answer “yes,” computes graph representing function.
منابع مشابه
tight frame approximation for multi-frames and super-frames
در این پایان نامه یک مولد برای چند قاب یا ابر قاب تولید شده تحت عمل نمایش یکانی تصویر برای گروه های شمارش پذیر گسسته بررسی خواهد شد. مثال هایی از این قاب ها چند قاب های گابور، ابرقاب های گابور و قاب هایی برای زیرفضاهای انتقال پایاست. نشان می دهیم که مولد چند قاب تنک نرمال شده (ابرقاب) یکتا وجود دارد به طوری که مینیمم فاصله را از ان دارد. همچنین مسایل مشابه برای قاب های دوگان مطرح شده و برخی ...
15 صفحه اولRandom Multi-Unit Assignment with Endogenous Quotas
We study the random multi-unit assignment problem in which the number of goods to be distributed depends on players’ preferences, obtaining several results that also apply to its corresponding version with fixed number of goods, commonly referred to as the course allocation problem. Although efficiency, envy-freeness, and group strategy-proofness can be achieved in the domain of dichotomous pre...
متن کاملRandom assignment with multi-unit demands
We consider the setting in which agents express preferences over objects, objects are allocated to agents based on the preferences, and there may be more objects than agents. In randomized settings, agents need to reason about their random allocations. The most well-established preference relation to compare random allocations of objects is stochastic dominance (SD). We present two impossibilit...
متن کاملGross substitutes and endowed assignment valuations
We show that the class of preferences satisfying the Gross Substitutes condition of Kelso and Crawford (1982) is strictly larger than the class of Endowed Assignment Valuations of Hatfield and Milgrom (2005), thus resolving the open question posed by the latter paper. In particular, our result implies that not every valuation function that satisfies the Gross Substitutes condition can be “decom...
متن کاملA Fast Heuristic Algorithm for the Train Unit Assignment Problem
In this paper we study a railway optimization problem known as the Train Unit Assignment Problem. A train unit consists of a self-contained train with an engine and a set of wagons with passenger seats. Given a set of timetabled train trips, each with a required number of passenger seats, and a set of train units, each with a given number of available seats, the problem calls for the best assig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japan Journal of Industrial and Applied Mathematics
سال: 2023
ISSN: ['0916-7005', '1868-937X']
DOI: https://doi.org/10.1007/s13160-023-00597-4